Hierarchical Verification of the Implementation of The IEEE-754 Table-Driven Floating-Point Exponential Function using HOL

نویسندگان

  • Amr T. Abdel-Hamid
  • Sofiéne Tahar
  • John Harrison
چکیده

The IEEE-754 floating-point standard, used in nearly all floating-point applications, is considered one of the most important standards. Deep datapath and algorithm complexity have made the verification of such floating-point units a very hard task. Most simulation and reachability analysis verification tools fail to verify a circuit with a deep datapath like most industrial floating-point units. Theorem proving, however, offers a better solution to handle such verification. In this report we have formalized and verified a hardware implementation of the IEEE-754 Table-Driven floating-point exponential function algorithm using the HOL theorem prover. The high ability of abstraction in the HOL verification system allows its use for the verification task over the whole design path of the circuit, starting from the gate level implementation of the circuit up to a higher level behavioral specification. To achieve this goal, we have used both hierarchical and modular approaches for modeling and verifying the floatingpoint exponential function in HOL.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hierarchical Verification of the IEEE-754 Table-Driven Floating-Point Exponential Function using HOL

complies with the regulations of the University and meets the accepted standards with respect to originality and quality.

متن کامل

Verifying a Synthesized Implementation of IEEE-754 Floating-Point Exponential Function using HOL

Deep datapath and algorithm complexity have made the verification of floating-point units a very hard task. Most simulation and reachability analysis verification tools fail to verify a circuit with a deep datapath like most industrial floating-point units. Theorem proving, however, offers a better solution to handle such verification. In this paper, we have hierarchically formalized and verifi...

متن کامل

Hierarchical Approach for the Verification of an IEEE - 754 Floating - Point Function

In this work, we have formalized and verified a hardware implementation of the Table-Driven algorithm for the floating-point exponential function. We have used a hierarchical approach enabling the verification of this function from the gate level implementation up to a behavioral specification adapted from the high level algorithmic description written by Harrison [3].

متن کامل

Floating Point Verification in HOL Light: The Exponential Function

Since they often embody compact but mathematically sophisticated algorithms , operations for computing the common transcendental functions in oating point arithmetic seem good targets for formal veriication using a mechanical theorem prover. We discuss some of the general issues that arise in veriications of this class, and then present a machine-checked veriication of an algorithm for computin...

متن کامل

A Formal Model of IEEE Floating Point Arithmetic

This development provides a formal model of IEEE-754 floatingpoint arithmetic. This formalization, including formal specification of the standard and proofs of important properties of floating-point arithmetic, forms the foundation for verifying programs with floating-point computation. There is also a code generation setup for floats so that we can execute programs using this formalization in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001